Unipotent Jacobian Matrices and Univalent Maps
نویسندگان
چکیده
The Jacobian Conjecture would follow if it were known that real polynomial maps with a unipotent Jacobian matrix are injective. The conjecture that this is true even for C maps is explored here. Some results known in the polynomial case are extended to the C context, and some special cases are resolved.
منابع مشابه
More about measures and Jacobians of singular random matrices
In this work are studied the Jacobians of certain singular transformations and the corresponding measures which support the jacobian computations.
متن کاملLinearized polynomial maps over finite fields
We consider polynomial maps described by so-called (multivariate) linearized polynomials. These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps without mixed terms over a characteristic zero field, we will only obtain (up to a linear transformation of the variables) triangular maps, which are the most b...
متن کاملWatermarking Scheme Based on Multiple Chaotic Maps
a watermarking scheme for Grayscale image isproposed based on a family of the chaotic maps and discretecosine transform. Jacobian Elliptic mapis employed to encrypt ofwatermarked logo. Piecewise nonlinear chaotic map is also usedto determine the location of DCT coefficients for the watermarkembedding. The purpose of this algorithm is to improve theshortcoming of watermarking such as small key s...
متن کاملAn Open Mapping Theorem using unbounded Generalized Jacobians∗
In this paper, three key theorems (the open mapping theorem, the inverse function theorem, and the implicit function theorem) for continuously differentiable maps are shown to hold for nonsmooth continuous maps which are not necessarily Lipschitz continuous. The significance of these extensions is that they are given using generalized Jacobians, called approximate Jacobians. The approximate Jac...
متن کاملThe Efficient Computation of Sparse Jacobian Matrices Using Automatic Differentiation
This paper is concerned with the efficient computation of sparse Jacobian matrices of nonlinear vector maps using automatic differentiation (AD). Specifically, we propose the use of a graph coloring technique, bicoloring, to exploit the sparsity of the Jacobian matrix J and thereby allow for the efficient determination of J using AD software. We analyze both a direct scheme and a substitution p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008